Types of sequence

Arithmetic Sequences

Definition:

An arithmetic sequence is a sequence in which each term is obtained by adding a constant difference d to the previous term. The general form of an arithmetic sequence is:

an=a1+(n1)d

where:

Example:

Consider the arithmetic sequence with a1=3 and d=2. The sequence is:

3,5,7,9,11,

Using the formula for the n-th term:

an=3+(n1)2=2n+1

Sum of an Arithmetic Sequence:

The sum of the first n terms of an arithmetic sequence (arithmetic series) is given by:

Sn=n2(a1+an)

or equivalently:

Sn=n2(2a1+(n1)d)

Geometric Sequences

Definition:

A geometric sequence is a sequence in which each term is obtained by multiplying the previous term by a constant ratio r. The general form of a geometric sequence is:

an=a1rn1

where:

Example:

Consider the geometric sequence with a1=2 and r=3. The sequence is:

2,6,18,54,162,

Using the formula for the n-th term:

an=23n1

Sum of a Geometric Sequence:

The sum of the first n terms of a geometric sequence (geometric series) is given by:

Sn=a11rn1r,r1

The sum of an infinite geometric series is:

S=a11r,|r|<1

Harmonic Sequences

Definition:

A harmonic sequence is a sequence where each term is the reciprocal of the corresponding term in an arithmetic sequence. The general form of a harmonic sequence is:

an=1n

or, more generally:

an=1a1+(n1)d

where a1 is the first term and d is the common difference of the corresponding arithmetic sequence.

Example:

The harmonic sequence corresponding to the arithmetic sequence 1,2,3,4, is:

1,12,13,14,

Harmonic Series:

The sum of the harmonic sequence (the harmonic series) is:

n=11n=1+12+13+

This series diverges, meaning it grows without bound as more terms are added, even though each term gets smaller.


Recursive Sequences

Definition:

A recursive sequence is defined by a recurrence relation, where each term is a function of one or more of the previous terms. Instead of providing an explicit formula for an, a recursive sequence gives a relationship between an and previous terms like an1, an2, etc.

Example:

The sequence defined by the recurrence relation:

an=an1+2,a1=3

is a recursive arithmetic sequence where each term is the previous term plus 2. The sequence is:

3,5,7,9,11,

General Recursive Formula:

Many recursive sequences are defined in terms of both initial conditions and a recursive formula.

Example (Geometric Recursive):

an=ran1,a1=2

With r=3, the sequence is:

2,6,18,54,

Fibonacci Sequence

Definition:

The Fibonacci sequence is a famous recursive sequence where each term is the sum of the two preceding terms. The sequence is defined by the recurrence relation:

Fn=Fn1+Fn2,F1=1,F2=1

The first few terms of the Fibonacci sequence are:

1,1,2,3,5,8,13,21,34,

Properties of the Fibonacci Sequence:

limnFn+1Fn=1+521.618